Counterfactual Donkey Sentences: A Strict Conditional Analysis
نویسندگان
چکیده
منابع مشابه
Counterfactual Donkey Sentences: A Response to
Robert van Rooij (2006) proposed an analysis of counterfactual donkey sentences by combining the Stalnaker–Lewis analysis of counterfactuals with standard dynamic semantics. This paper points out some problems with van Rooij’s treatment of counterfactual sentences in the language of first-order logic and provides a new interpretation using dynamic semantics. 1 VAN ROOIJ’S THEORY OF COUNTERFACTUAL
متن کاملSentiment Analysis of Conditional Sentences
This paper studies sentiment analysis of conditional sentences. The aim is to determine whether opinions expressed on different topics in a conditional sentence are positive, negative or neutral. Conditional sentences are one of the commonly used language constructs in text. In a typical document, there are around 8% of such sentences. Due to the condition clause, sentiments expressed in a cond...
متن کاملThe Event-Dependent Individuals and the Ambiguity of Donkey Sentences
This paper addresses multiple proportional readings in donkey sentences and deals with a question of why the disambiguation of proportional readings is affected by the topic structure of a sentence. The correlation between proportional readings and topic structure has been observed by Heim (1990) and Chierchia (1992) but has not been given a satisfactory explanation yet. Based on my previous st...
متن کاملPragmatic Strengthening in Plural Predications and Donkey Sentences
(2.a) is called the symmetric interpretation, and (2.b) the (subject-) asymmetric interpretation by Kadmon (1987). In (2.b), the donkey variable y is called dependent. With asymmetric interpretations the question arises how the dependent variable is interpreted within the second argument, the nuclear scope. This issue is taken up in Rooth (1987). He distinguishes two cases, a “weak” or existent...
متن کاملOrdinal Conditional Functions for Nearly Counterfactual Revision
We are interested in belief revision involving conditional statements where the antecedent is almost certainly false. To represent such problems, we use Ordinal Conditional Functions that may take infinite values. We model belief change in this context through simple arithmetical operations that allow us to capture the intuition that certain antecedents can not be validated by any number of obs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Semantics and Linguistic Theory
سال: 2015
ISSN: 2163-5951
DOI: 10.3765/salt.v25i0.3056